TR-2007015: Justification Logics and Conservative Extensions

نویسنده

  • Melvin Fitting
چکیده

Several justification logics have evolved, starting with the logic LP, [2]. These can be thought of as explicit versions of modal logics, or logics of knowledge or belief in which the unanalyzed necessity operator has been replaced with a family of explicit justification terms. Modal logics come in various strengths. For their corresponding justification logics, differing strength is reflected in different vocabularies. What we show here is that for justification logics corresponding to modal logics extending T, extensions are actually conservative. Our method of proof is very simple, and general enough to also handle several justification logics not directly corresponding to modal logics. Our methods do not, however, allow us to prove comparable results for justification logics corresponding to modal logics that do not extend T. That is, we are able to handle explicit logics of knowledge, but not explicit logics of belief. This remains open.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Justification Logics and Conservative Extensions

Several justification logics have evolved, starting with the logic LP, [2]. These can be thought of as explicit versions of modal logics, or logics of knowledge or belief in which the unanalyzed necessity operator has been replaced with a family of explicit justification terms. Modal logics come in various strengths. For their corresponding justification logics, differing strength is reflected ...

متن کامل

Explicit Logics of Knowledge and Conservativity

Several justification logics have evolved, starting with the logic LP, (Artemov 2001). These can be thought of as explicit versions of modal logics, or logics of knowledge or belief, in which the unanalyzed necessity (knowledge, belief) operator has been replaced with a family of explicit justification terms. Modal logics come in various strengths. For their corresponding justification logics, ...

متن کامل

Justifications, Ontology, and Conservativity

An ontologically transparent semantics for justifications that interprets justifications as sets of formulas they justify has been recently presented by Artemov. However, this semantics of modular models has only been studied for the case of the basic justification logic J, corresponding to the modal logic K. It has been left open how to extend and relate modular models to the already existing ...

متن کامل

A Note on Fixed Points in Justification Logics and the Surprise Test Paradox

In this note we study the effect of adding fixed points to justification logics. We introduce two extensions of justification logics: extensions by fixed point (or diagonal) operators, and extensions by least fixed points. The former is a justification version of Smoryǹski’s Diagonalization Operator Logic, and the latter is a justification version of Kozen’s modal μcalculus. We also introduce f...

متن کامل

On the Complexity of Two-Agent Justification Logic

We investigate the complexity of derivability for two-agent Justification Logic. For this purpose we revisit Yavorskaya’s two-agent LP with interactions (2008), we simplify the syntax and provide natural extensions. We consider two-agent versions of other justification logics as well as ways to combine two justification logics. For most of these cases we prove that the upper complexity bound es...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016